﻿\newpage
\section{Библиография}
\begin{thebibliography}{99}

\bibitem{ACR}
Aberkane A. The number of ternary words avoiding Abelian cubes grows exponentially
/ A. Aberkane, J. D. Currie, N. Rampersad
// J. Int. Seq. - 2004. - 7., \#04.2.7 - p. 13.

\bibitem{Aho}
Aho A.V. Efficient string matching: An aid to bibliographic search
/ A.V. Aho, M.J. Corasick
// Communications of the ACM. - 1975. - V. 18(6). - p. 333-340.

\bibitem{Carpi-Dejean}
Carpi A. On Dejean's conjecture over large alphabets
/ A. Carpi
// Theor. Comput. Sci. - 2007. - 385. - p. 137-151.

\bibitem{Carpi-1}
Carpi A. On the number of Abelian square-free words on four letters
/ A. Carpi
// Discr. Appl. Math. - 1998 - 81. - p. 155-167.

\bibitem{Currie}
Currie J.D. The number of binary words avoiding Abelian fourth powers grows exponentially
/ J.D. Currie
// Theor. Comput. Sci. - 2004. - 319(1-3). - p. 441-446.

\bibitem {CR-Dejean}
Currie J.D. A proof of Dejean's conjecture
/ J.D. Currie, N. Rampersad
// Mathematics of Computation - 2010. - DOI: 10.1090/S0025-5718-2010-02407-X 

\bibitem {Dejean}
Dejean F. Sur un Th\'eor\`eme de Thue
/ F. Dejean
// J. Comb. Theory A - 1972. - 13(1). - p. 90-99.

\bibitem {Dekking}
Dekking F.M. Strongly non-repetitive sequences and progression-free sets
/ F.M. Dekking
// J. Combin. Theory A - 1979. - 27. - p. 181-185.

\bibitem {Erdos}
Erd\"os P. Some unsolved problems
/ P. Erd\"os
// Magyar Tud. Akad. Mat. Kutat\'o Int. K\"ozl. - 1961. - 6. - p. 221-264.

\bibitem{Godsil}
Godsil C.D. Algebraic combinatorics
/ C.D. Godsil.
// New York: Chapman and Hall, 1993. - 368 p.

\bibitem {Karkkainen}
K\"arkk\"ainen J. Simple linear work suffix array construction
/ J. K\"arkk\"ainen
// Proc. ICALP'03, Springer, Berlin (LNCS 2719). - 2003. - p. 943-955.

\bibitem {Keranen}
Ker\"anen V. Abelian squares are avoidable on 4 letters
/ V. Ker\"anen
// Proc. ICALP'92, Springer, Berlin (LNCS 623). - 1992. - p. 41-52.

\bibitem {Manber}
Manber U. Suffix arrays: a new method for on-line string searches
/ U. Manber, G. Myers
// SIAM Journal on Computing. - 1993. - V22(5). - p. 935-948.

\bibitem {Rao-Dejean}
Rao M. Last Cases of Dejean's Conjecture
/ M. Rao
// Proceedings of the 7th International Conference on Words, Salerno, Italy. - 2009. - p. 115.

\bibitem{Samsonov-Shur}
Samsonov A.V. On Abelian repetition threshold
/ A.V. Samsonov, A.M. Shur
// Proc. 13th Mons Theor. Comp. Sci. Days. - 2010.

\bibitem{Schurmann}
Sch\"urmann K. An incomplex algorithm for fast suffix array construction
/ K. Sch\"urmann, J. Stoye
// Proc. ALENEX/ANALCO 2005. - 2005. - p. 77-85.

\bibitem{Shur-Algo}
Shur A.M. Growth rates of complexity of power-free languages
/ A.M. Shur
// Theor. Comput. Sci. - 2010. - 411. - p. 3209-3223.

\bibitem{Tarjan}
Tarjan R. Depth-first search and linear graph algorithms.
/ R. Tarjan
// SIAM Journal on Computing. - 1972. - V. 1, No. 2. - p. 146-160.

\bibitem{Thue}
Thue A. \"Uber unendliche Zeichenreihen.
/ A. Thue
// Kra. Vidensk. Selsk. Skrifter. I. Mat.–Nat. Kl. – 1906. – V. 7. – p. 1–22.

\end{thebibliography}
